Root Mean Square Minimum Distance: a Quality Metric for Localization Nanoscopy Imaging

نویسنده

  • Yi Sun
چکیده

A localization algorithm in optical localization nanoscopy plays an important role in obtaining a highquality image. By challenging 2D synthetic nanoscopy data, performances of 32 localization software packages were recently evaluated. The challenge has been advanced to focus on 3D imaging and become an open public online challenge that up to now has drawn 84 participant packages. A universal and objective metric, which is crucial and necessary to evaluate qualities of nanoscopy images and performances of localization algorithms, has not yet been established in the field. In the current challenges the root mean square error (RMSE, also termed accuracy), precision, recall, and Jaccard index (JAC), between an image of estimated fluorophore locations and the image of ground-truth locations, are used as quality metrics. As analyzed in Supplementary Discussion, these metrics depend on the full-width halfmaximum (FWHM) of the point spread function in an optical system and therefore are not universal and somewhat subjective, and in certain conditions fail to distinguish qualities of different nanoscopy images. In this paper we propose the root mean square minimum distance (RMSMD) as a quality metric for localization nanoscopy imaging, analyze its properties, and demonstrate analytically and by example its advantages over the metrics used in the current challenges. We first define the mean square minimum distance (MSMD) between two sets of n-dimensional points, X and S, as

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

مقایسه روش‌های طبقه‌بندی‌کننده حداکثر مشابهت و حداقل فاصله از میانگین در تهیه نقشه پوشش اراضی (مطالعه موردی: استان اصفهان)

Land cover maps derived from satellite images play a key role in regional and national land cover assessments. In order to compare maximum likelihood and minimum distance to mean classifiers, LISS-III images from IRS-P6 satellite were acquired in August 2008 from the western part of Isfahan. First, the LISS-III image was georeferenced. The Root Mean Square error of less than one pixel was the r...

متن کامل

Augmenting intraoperative ultrasound with preoperative magnetic resonance planning models for percutaneous renal access

BACKGROUND Ultrasound (US) is a commonly-used intraoperative imaging modality for guiding percutaneous renal access (PRA). However, the anatomy identification and target localization abilities of the US imaging are limited. This paper evaluates the feasibility and efficiency of a proposed image-guided PRA by augmenting the intraoperative US with preoperative magnetic resonance (MR) planning mod...

متن کامل

Distribution of Reciprocal of Interatomic Distances: A Fast Structural Metric.

We present a structural metric based on the Distribution of Reciprocal of Interatomic Distances (DRID) for evaluating geometrical similarity between two conformations of a molecule. A molecular conformation is described by a vector of 3N orientation-independent DRID descriptors where N is the number of molecular centroids, for example, the non-hydrogen atoms in all nonsymmetric groups of a pept...

متن کامل

Metric to evaluate the texture visibility of halftone patterns

Halftones are intended to produce the illusion of continuous images from binary output states, so the visibility of undesired halftone textures is an essential quality factor of halftone patterns. We propose a metric to predict the visibility of color halftone textures. The metric utilizes the human visual threshold function and contrast sensitivity functions (CSF) of luminance and chrominance....

متن کامل

A CHARACTERIZATION FOR METRIC TWO-DIMENSIONAL GRAPHS AND THEIR ENUMERATION

‎The textit{metric dimension} of a connected graph $G$ is the minimum number of vertices in a subset $B$ of $G$ such that all other vertices are uniquely determined by their distances to the vertices in $B$‎. ‎In this case‎, ‎$B$ is called a textit{metric basis} for $G$‎. ‎The textit{basic distance} of a metric two dimensional graph $G$ is the distance between the elements of $B$‎. ‎Givi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2018